The Complexity of Generalized Domino Tilings

نویسندگان

Igor Pak

Jed Yang

چکیده

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NPand #Pcompleteness) for different generalizations of dominoes in three and higher dimensions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Statistics for Random Domino Tilings of the Aztec Diamond

We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of adjacent lattice squares. This formula quantiies the eeect of the dia-mond's boundary conditions on the behavior of typical tilings; in addition, it yields a new proof of ...

متن کامل

The Z Alpern Multi-tower Theorem for Rectangles: a Tiling Approach

We provide a proof of the Alpern multi-tower theorem for Z d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z action by a collection of rectangles whose corresponding sides have no non-trivial common divisors. We associate to such a collection of rectangles a special family of generalized domino tilings. We then identify an intrinsic dynamic property of these ...

متن کامل

An optimal algorithm to generate tilings

We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input. We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston’s algorithm for constructing a particular tiling. We then describe our algorithm and study its...

متن کامل

Bridget Eileen Tenner

The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino tilings, modulo 2, and leads to a variety of corollaries, including that the number of domino tilings of a k× 2k rectangle is congruent to 1 mod 4.

متن کامل